The modified barrier function method for linear programming and its extensions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extensions of the Multiplicative Penalty Function Method for Linear Programming

We shall extend Iri's multiplicative penalty function method for linear programming [41 so that it can handle the problem of unknown optimum value of the objective function, without solving both primal and dual problems simultaneously, and generate convergent dual solutions. By making use of these dual variables, lower bounds of the optimum objective function value are updated efficiently, whic...

متن کامل

On the Convergence of a Modiied Barrier Function Method for Convex Quadratic and Linear Programming

We analyze convergence properties of the Modiied Barrier Function Method (MBFM), which operates like the usual Augmented Lagrangian method, except that it uses a shifted logarithmic barrier function in place of the usual quadratic penalty function. The MBFM avoids some of the drawbacks of classical barrier methods. The convergence of the MBFM had previously been established under strict regular...

متن کامل

Why the logarithmic barrier function in convex and linear programming?

We provide a simple interpretation of the use of the logarithmic barrier function in convex and linear programming. c © 2000 Elsevier Science B.V. All rights reserved. MSC: 90C05; 90C25

متن کامل

Remarks on Potential versus Barrier Function Methods for Linear Programming*

Abstmci We will point out some relations between potential and barrier function methods for linear programming. Then, based on the relations, we will show that the classical logarithmic barrier function method for linear programming can be adjusted so that it generates the optimal solution in O( ."jnL) iterations, where n is the number of variables and L is the data length. The method can be se...

متن کامل

Defuzzification Method for Solving ‎Fuzzy ‎Linear Programming Problems

Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1990

ISSN: 0898-1221

DOI: 10.1016/0898-1221(90)90026-g